On the immunity of rotation symmetric Boolean functions against fast algebraic attacks
نویسندگان
چکیده
In this paper, it is shown that an n-variable rotation symmetric Boolean function f with n even but not a power of 2 admits a rotation symmetric function g of degree at most e ≤ n/3 such that the product gf has degree at most n− e− 1.
منابع مشابه
New Construction of Even-variable Rotation Symmetric Boolean Functions with Optimum Algebraic Immunity
The rotation symmetric Boolean functions which are invariant under the action of cyclic group have been used as components of different cryptosystems. In order to resist algebraic attacks, Boolean functions should have high algebraic immunity. This paper studies the construction of even-variable rotation symmetric Boolean functions with optimum algebraic immunity. We construct ( / 4 3) n ...
متن کاملLower Bounds on Algebraic Immunity of Boolean Functions
In the recently developed algebraic attacks applying to block and stream ciphers([1-5]), the concept of algebraic immunity (AI) is introduced in [6] and studied in [6-14]. High algebraic immunity is a necessary condition for resisting algebraic attacks. In this paper, we give some lower bounds on algebraic immunity of Boolean functions. The results are applied to give lower bounds on AI of symm...
متن کاملLower Bounds on the Algebraic Immunity of Boolean Functions
From the motivation of algebraic attacks to stream and block ciphers([1,2,7,13,14,15]), the concept of algebraic immunity (AI) of a Boolean function was introduced in [21] and studied in [3,5,10,11,17,18,19,20,21]. High algebraic immunity is a necessary condition for resisting algebraic attacks. In this paper, we give some lower bounds on the algebraic immunity of Boolean functions. The results...
متن کاملEfficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
In this paper we propose several efficient algorithms for assessing the resistance of Boolean functions against algebraic and fast algebraic attacks when implemented in LFSR-based stream ciphers. An algorithm is described which permits to compute the algebraic immunity d of a Boolean function with n variables in O(D) operations, for D ≈ ` n d ́ , rather than in O(D) operations necessary in all p...
متن کاملOn the immunity of Boolean functions against fast algebraic attacks using bivariate polynomial representation
In the last decade, algebraic and fast algebraic attacks are regarded as the most successful attacks on LFSR-based stream ciphers. Since the notion of algebraic immunity was introduced, the properties and constructions of Boolean functions with maximum algebraic immunity have been researched in a large number of papers. However, it is unclear whether these functions behave well against fast alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2012 شماره
صفحات -
تاریخ انتشار 2012